Directivity Optimization in Planar Sub-arrayed Monopulse Antenna
نویسندگان
چکیده
In this paper, the Contiguous Partition Method (CPM) is applied to the optimization of the directivity of difference patterns in monopulse planar array antennas. Since the excitations providing maximum directivity of planar arrays can be analytically computed and because of the excitation matching nature of the CPM, the problem at hand is recast as the synthesis of the difference compromise solution close as much as possible to the reference pattern with maximum directivity. Selected results are shown to point out the potentialities of the CPM-based approach.
منابع مشابه
An Excitationmatching Procedure for Sub-arrayed Monopulse Arrays with Maximum Directivity
In this paper, the maximization of the directivity of compromise difference patterns in subarrayed monopulse linear array antennas with optimum sum mode is addressed by means of a two-stage excitation matching procedure. The knowledge of the independently optimum difference excitations, which provide the maximum directivity, is exploited with an efficient matching technique based on the contigu...
متن کاملSynthesis of Monopulse Sub-arrayed Linear and Planar Array Antennas with Optimized Sidelobes
In this paper, three approaches for the synthesis of the optimal compromise between sum and difference patterns for subarrayed linear and planar arrays are presented. The synthesis problem is formulated as the definition of the sub-array configuration and the corresponding sub-array weights to minimize the maximum level of the sidelobes of the compromise difference pattern. In the first approac...
متن کاملSynthesis of Sub-arrayed Monopulse Planar Arrays by Means of an Innovative Excitation Matching Method
متن کامل
Ant Colony Based Hybrid Approach for Optimal Compromise Sum-difference Patterns Synthesis
Dealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so-called optimal compromise problem between sum and difference patterns when sub-arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub-set of the unknowns (i.e., the sub-array ex...
متن کامل